Computing Popov Form of General Ore Polynomial Matrices

نویسندگان

  • Patrick Davies
  • Howard Cheng
  • George Labahn
چکیده

We show that the computation of the Popov form of Ore polynomial matrices can be formulated as a problem of computing the left nullspace of such matrices. While this technique is already known for polynomial matrices, the extension to Ore polynomial matrices is not immediate because multiplication of the matrix entries is not commutative. A number of results for polynomial matrices are extended to Ore polynomial matrices in this paper. This in turn allows nullspace algorithms to be used in Popov form computations. Unlike a previous work, there is no assumption on whether the input matrix has full row rank. In particular, recent fraction-free and modular algorithms for nullspace computation can be used in exact arithmetic setting where coefficient growth is a concern. When specialized to ordinary polynomial matrices, our results simplify the proofs for the computation of Popov form while maintaining the same worst case complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Popov Form of Ore Polynomial Matrices

We show that the computation of the Popov form of Ore polynomial matrices can be formulated as a problem of computing the left nullspace of such matrices. While this technique is already known for polynomial matrices, the extension to Ore polynomial matrices is not immediate because multiplication of the matrix entries is not commutative. A number of results for polynomial matrices are extended...

متن کامل

Fraction-free row reduction of matrices of Ore polynomials

In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspace of such matrices. When specialized to matrices of skew polynomials our reduction can be used for computing a weak Popov form of such matrices and for computing a GCRD and an LCLM of skew polynomials or matrices of s...

متن کامل

A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices

We briefly review a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in Z[t], and describe a practical implementation in Maple that improves over previous modular and fraction-free versions. The algorithm can be used for finding the rank, left nullspace, and the Popov form of such matrices.

متن کامل

Popov Form Computation for Matrices of Ore Polynomials

Let F[∂;σ ,δ] be a ring of Ore polynomials over a field. We give a new deterministic algorithm for computing the Popov form P of a non-singular matrix A ∈ F[∂;σ ,δ]n×n . Our main focus is to ensure controlled growth in the size of coefficients from F in the case F = k(z), and even k = Q. Our algorithms are based on constructing from A a linear system over F and performing a structured fraction-...

متن کامل

Modular Computation for Matrices of Ore Polynomials

We give a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in Z[t]. Both the transformation matrix and the transformed matrix are computed. The algorithm can be used for finding the rank and left nullspace of such matrices. In the special case of shift polynomials, we obtain algorithms for computing a weak Popov form and for computing a greatest common...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007